Brouwer Fixed Point Theorem in the General Case

نویسنده

  • Karol Pak
چکیده

For simplicity, we adopt the following convention: n is a natural number, p, q, u, w are points of En T, S is a subset of En T, A, B are convex subsets of En T, and r is a real number. Next we state several propositions: (1) (1− r) · p+ r · q = p+ r · (q − p). (2) If u, w ∈ halfline(p, q) and |u− p| = |w − p|, then u = w. (3) Let given S. Suppose p ∈ S and p 6= q and S ∩ halfline(p, q) is Bounded. Then there exists w such that (i) w ∈ FrS ∩ halfline(p, q), (ii) for every u such that u ∈ S ∩ halfline(p, q) holds |p− u| ≤ |p−w|, and (iii) for every r such that r > 0 there exists u such that u ∈ S∩halfline(p, q) and |w − u| < r.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Combinatorial Approach to the Brouwer Fixed Point Theorem

The Brouwer Fixed Point Theorem states that any continuous mapping from a closed ball in Euclidean space to itself has at least one fixed point. This theorem has a wide variety of applications in areas such as differential equations, economics, and game theory. Although this is fundamentally an analytic and topological statement, there exists an elegant combinatorial proof using Sperner’s Lemma...

متن کامل

A constructive proof of the general Brouwer fixed point theorem and related computational results in general non-convex sets

In this paper, by introducing twice continuously differentiable mappings, we develop an interior path following following method, which enables us to give a constructive proof of the general Brouwer fixed point theorem and thus to solve fixed point problems in a class of non-convex sets. Under suitable conditions, a smooth path can be proven to exist. This can lead to an implementable globally ...

متن کامل

The Hex Game Theorem and the Arrow Impossibility Theorem: the Case of Weak Orders

The Arrow impossibility theorem when individual preferences are weak orders is equivalent to the HEX game theorem. Because Gale showed that the Brouwer fixed point theorem is equivalent to the HEX game theorem, this paper indirectly shows the equivalence of the Brouwer fixed point theorem and the Arrow impossibility theorem. Chichilnisky showed the equivalence of her impossibility theorem and t...

متن کامل

A New Conservative Difference Scheme for the General Rosenau-RLW Equation

A new conservative finite difference scheme is presented for an initial-boundary value problem of the general Rosenau-RLW equation. Existence of its difference solutions are proved by Brouwer fixed point theorem. It is proved by the discrete energy method that the scheme is uniquely solvable, unconditionally stable, and second-order convergent. Numerical examples show the efficiency of the scheme.

متن کامل

Computable counter-examples to the Brouwer fixed-point theorem

This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and noncomputable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for finding the fixed point in general by giving an example of a computable function which does not fix any computable point. Research in reverse mathematics has...

متن کامل

Borsuk-Ulam Implies Brouwer: A Direct Construction

The Borsuk-Ulam theorem and the Brouwer fixed point theorem are well-known theorems of topology with a very similar flavor. Both are non-constructive existence results with somewhat surprising conclusions. Most topology textbooks that cover these theorems (e.g., [4], [5], [6]) do not mention the two are related—although, in fact, the Borsuk-Ulam theorem implies the Brouwer Fixed Point Theorem. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Formalized Mathematics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2011